package zuoye_50;

import java.util.Scanner;

//题目：一个偶数总能表示为两个素数之和。
public class Zuoye_044 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int num = sc.nextInt();
		while(num%2!=0){
			System.out.println("输入偶数!!");
			num = sc.nextInt();
		}
		twoAdd(num);
	}
	 private static void twoAdd(int n){
	        for(int i=2;i<n/2+1;i++){
	            if(isPrime(i)&&isPrime(n-i)){
	                System.out.println(n+"="+(i)+"+"+(n-i));
	                break;
	            }
	        }
	    }
	 private static boolean isPrime(int m){
	        boolean flag = true;
	        for(int i=2;i<Math.sqrt(m)+1;i++){
	            if(m%i==0){
	                flag = false;
	                break;
	            }
	        }
	        return flag;
	    }
}
